FPGA-Based Stream Processing for Frequent Itemset Mining with Incremental Multiple Hashes
نویسندگان
چکیده
منابع مشابه
Frequent Itemset Mining over Stream Data: Overview
During the past decade, stream data mining has been attracting widespread attentions of the experts and the researchers all over the world and a large number of interesting research results have been achieved. Among them, frequent itemset mining is one of main research branches of stream data mining with a fundamental and significant position. In order to further advance and develop the researc...
متن کاملIn-Stream Frequent Itemset Mining With Output Proportional Memory Footprint
We propose an online partial counting algorithm based on statistical inference that approximates itemset frequencies from data streams. The space complexity of our algorithm is proportional to the number of frequent itemsets in the stream at any time. Furthermore, the longer an itemset is frequent the closer is the approximation to its frequency, implying that the results become more precise as...
متن کاملFrequent Itemset Mining of Multiple Database s
Oftenti mes we need to investigate m ore than one source of data to provide a solution to the proble m at hand. This data integration proble m has been investigated and largely solved for simple situations in traditional relational database m a n age me nt syste ms (RDBMSes). They typically provide a m e a ns for the user to join datasets together based on a co m mo n si mple attribute. Not all...
متن کاملBit Stream Mask-Search Algorithm in Frequent Itemset Mining
Association Rules in data mining are generated by identifying relationships among set of items in transaction database. Finding frequent itemsets is computationally the most expensive step in Association rule discovery and therefore it has attracted significant research attention. Although several techniques have emerged, they are all inherently dependent on the memory availability. This paper ...
متن کاملMining Frequent Sequences Using Itemset-Based Extension
In this paper, we systematically explore an itemset-based extension approach for generating candidate sequence which contributes to a better and more straightforward search space traversal performance than traditional item-based extension approach. Based on this candidate generation approach, we present FINDER, a novel algorithm for discovering the set of all frequent sequences. FINDER is compo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Circuits and Systems
سال: 2016
ISSN: 2153-1285,2153-1293
DOI: 10.4236/cs.2016.710281